Generalized pursuit learning schemes: new families of continuous and discretized learning automata
نویسندگان
چکیده
منابع مشابه
Generalized pursuit learning schemes: new families of continuous and discretized learning automata
The fastest learning automata (LA) algorithms currently available fall in the family of estimator algorithms introduced by Thathachar and Sastry (1986). The pioneering work of these authors was the pursuit algorithm, which pursues only the current estimated optimal action. If this action is not the one with the minimum penalty probability, this algorithm pursues a wrong action. In this paper, w...
متن کاملContinuous and Discretized Generalized Pursuit Learning Schemes
A Learning Automaton is an automaton that interacts with a random environment, having as its goal the task of learning the optimal action based on its acquired experience. Many learning automata have been proposed, with the class of Estimator Algorithms being among the fastest ones. Thathachar and Sastry [24], through the Pursuit Algorithm, introduced the concept of learning algorithms. Their a...
متن کاملA Comparison of Continuous and Discretized Pursuit Learning Schemes
A Learning Automaton is an automaton that interacts with a random environment, having as its goal the task of learning the optimal action based on its acquired experience. Many learning automata have been proposed, with the class of Estimator Algorithms being among the fastest ones. Thathachar and Sastry [23], through the Pursuit Algorithm, introduced the concept of learning algorithms that pur...
متن کاملContinuous and discretized pursuit learning schemes: various algorithms and their comparison
A learning automaton (LA) is an automaton that interacts with a random environment, having as its goal the task of learning the optimal action based on its acquired experience. Many learning automata (LAs) have been proposed, with the class of estimator algorithms being among the fastest ones, Thathachar and Sastry, through the pursuit algorithm, introduced the concept of learning algorithms th...
متن کاملDiscretized estimator learning automata
BOUNDED MEMORY PROBABILISTIC MOVE-TO-FRONT OPERATIONS The concept of performing probabilistic move operations on an accessed element is not entirely new. Kan and Ross [9] suggested a probabilistic transposition scheme and showed that no advantage was obtained by rendering the scheme probabilistic. Their scheme, however, required that the probability of performing the operation, be time invarian...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Transactions on Systems, Man and Cybernetics, Part B (Cybernetics)
سال: 2002
ISSN: 1083-4419
DOI: 10.1109/tsmcb.2002.1049608